Space-filling curves for 2-simplicial meshes created with bisections and reflections

نویسنده

  • Joseph M. Maubach
چکیده

Numerical experiments in J. Maubach, Local bisection refinement and optimal order algebraic multilevel preconditioners, PRISM-97 conference Proceedings (eds. O. Axelsson et al), University of Nijmegen, the Netherlands, 1997, 121-136 indicated that the refinement with the use of local bisections presented in J. Maubach, Local bisection refinement for n-simplicial grids generated by reflections, SIAM Journal on Scientific Computing, 16(1995), 210-227 leads to highly locally refined computational 2-meshes which can be very efficiently load-balanced with the use of a space-filling curve. This paper introduces the construction of this curve, which can be produced at almost no costs, proofs that all its properties are invariant under the local bisection, and comments at the 3-dimensional case.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Time Complexity of algorithms that update the Sierpiński-like and Modified Hilbert Curves

This paper presents the time complexity of two algorithms that update space-filling curves of adaptively refined domains. The Modified Hilbert (space-filling) Curve was proposed to traverse square-shaped adaptive-refined meshes. Whereas, the Sierpiński-like (space-filling) Curve was proposed in order to traverse triangular-shaped adaptive-refined meshes. Those curves are variations of the names...

متن کامل

A Locality Preserving Graph Ordering Approach for Implicit Partitioning: Graph-Filing Curves

Linear orderings defined through space-filling curves are often applied to quickly partition graphs arising in finite element simulations. In applications with constant meshes but a rapidly changing load per element, an ordering has to be determined only once and all subsequent partitionings can be computed very quickly through a simple interval splitting. However, partitionings based on space-...

متن کامل

Space-filling Curves for Domain Decomposition in Scientific Simulations

Space-filling curves(SFC) have been widely accepted as an easy technique to generate good quality mesh partitions. In this work, we discuss the limitations of some of the existing methods for generating SFCs and propose a recursive algorithm for constructing a general SFC that works for a range of meshes in 2D and 3D. All of our test cases for the 2D SFC come from the meshes used in Community E...

متن کامل

Comparative Analysis of Quasi-Conformal Deformations in Shape Space

A novel approach based on the shape space concept is proposed to classify quasi-conformal deformations of 3D models. A new metric on the quotient space of meshes is introduced to capture changes of the curvature at each vertex of a simplicial complex during deformation. Then, the deformation curve is obtained by calculating the geodesic curve connecting two shapes in the shape space manifold. I...

متن کامل

Fast Low-discrepancy Sampling of Parametric Surfaces and Meshes

This paper summarises work on low-discrepancy sampling of parametric surfaces and meshes based on use of space-filling curves, and suggests two applications of such work: shape retrieval based on distance histograms, and non-photorealistic stroke-based rendering.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005